Conversion of Graphs to Polygonal Meshes
نویسنده
چکیده
I present a real-time rendering method for converting directed acyclic graphs to polygonal meshes directly on the GPU. The method is composed of two steps. First a graph, where each node has information about its direction, radius and length, is used to construct a nonintersecting, provided well-defined input, topologically correct, closed polygon mesh. This produces a coarse mesh in real-time and the second step of the method then improves the visual quality of the mesh, by automatically tessellating it. This smoothes the mesh and provides automatic level of detail. Both steps are carried out on the GPU in the geometry shader stage, which carries certain restrictions on the techniques available and the quality of the mesh that can be produced. This method can be used to take a graph of a branching structure, such as plants, trees, character and creature skeletons, and produce, in real-time, a 3D polygonal mesh.
منابع مشابه
A freeform shape optimization of complex structures represented by arbitrary polygonal or polyhedral meshes
In this paper we propose a new scheme for freeform shape optimization on arbitrary polygonal or polyhedral meshes. The approach consists of three main steps: (1) surface partitioning of polygonal meshes into different patches; (2) a new freeform perturbation scheme of using the Cox–de Boor basis function over arbitrary polygonal meshes, which supports multi-resolution shape optimization and doe...
متن کاملSolving elliptic eigenvalue problems on polygonal meshes using discontinuous Galerkin composite finite element methods
In this paper we introduce a discontinuous Galerkin method on polygonal meshes. This method arises from the Discontinuous Galerkin Composite Finite Element Method (DGFEM) for source problems on domains with micro-structures. In the context of the present paper, the flexibility of DGFEM is applied to handle polygonal meshes. We prove the a priori convergence of the method for both eigenvalues an...
متن کاملMesh repair with user-friendly topology control
Limitations of current 3D acquisition technology often lead to polygonal meshes exhibiting a number of geometrical and topological defects which prevent them from widespread use. In this paper we present a new method for model repair which takes as input an arbitrary polygonal mesh and outputs a valid two-manifold triangle mesh. Unlike previous work, our method allows users to quickly identify ...
متن کاملA new scheme for e cient and direct shape optimization of complex structures represented by polygonal meshes
In this paper, a new shape optimization approach is proposed to provide an e cient optimization solution of complex structures represented by polygonal meshes. Our approach consists of three main steps: (1) surface partitioning of polygonal meshes; (2) generation of shape design variables on the basis of partitioned surface patches; and (3) gradient-based shape optimization of the structures by...
متن کامل3D Shape Matching Using Skeleton Graphs
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to make assumptions about the similarity of the 3D models, we search for the biggest common subgraph. As internal skeleton graphs normally do not consist of many edges, the problem of exponential time complexity due to NP ...
متن کامل